Extrapolation algorithm for affine-convex feasibility problems
نویسندگان
چکیده
منابع مشابه
A finite steps algorithm for solving convex feasibility problems
This paper develops an approach for solving convex feasibility problems where the constraints are given by the intersection of two convex cones in a Hilbert space. An extension to the feasibility problem for the intersection of two convex sets is presented as well. It is shown that one can solve such problems in a finite number of steps and an explicit upper bound for the required number of ste...
متن کاملA Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
We introduce a class of nonconvex/affine feasibility (NCF) problems that consists of finding a point in the intersection of affine constraints with a nonconvex closed set. This class captures some interesting fundamental and NP hard problems arising in various application areas such as sparse recovery of signals and affine rank minimization that we briefly review. Exploiting the special structu...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملTheory and Applications of Convex and Non-convex Feasibility Problems
Let X be a Hilbert space and let Cn, n = 1, . . . ,N be convex closed subsets of X . The convex feasibility problem is to find some point x ∈ N ⋂ n=1 Cn, when this intersection is non-empty. In this talk we discuss projection algorithms for finding such a feasibility point. These algorithms have wide ranging applications including: solutions to convex inequalities, minimization of convex nonsmo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2005
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-005-9010-6